An Improved Computationally Efficient Method for Finding the Drazin Inverse

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Higher Order Iterative Method for Computing the Drazin Inverse

A method with high convergence rate for finding approximate inverses of nonsingular matrices is suggested and established analytically. An extension of the introduced computational scheme to general square matrices is defined. The extended method could be used for finding the Drazin inverse. The application of the scheme on large sparse test matrices alongside the use in preconditioning of line...

متن کامل

The Quasi-Normal Direction (QND) Method: An Efficient Method for Finding the Pareto Frontier in Multi-Objective Optimization Problems

In managerial and economic applications, there appear problems in which the goal is to simultaneously optimize several criteria functions (CFs). However, since the CFs are in conflict with each other in such cases, there is not a feasible point available at which all CFs could be optimized simultaneously. Thus, in such cases, a set of points, referred to as 'non-dominate' points (NDPs), will be...

متن کامل

An Improved Convergent Iterative Method for Finding the Moore- Penrose Inverse

The goal of this paper is to suggest and establish an efficient iterative method based on matrix by matrix multiplications for finding the approximate inverse of nonsingular square matrices. We then analytically extend this proposed method so as to compute the Moore-Penrose generalized inverse of a non-square matrix. A theoretical analysis has been employed to compare the computational efficien...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

An extension of the perturbation analysis for the Drazin inverse

Let A denote a square complex matrix and let E be a perturbation matrix. The purpose of this paper is to investigate the perturbation of the Drazin inverse when B = A + E satisfies the rank conditions rankA = rankB = rankAB, where r and s denote the indices of A and B, respectively. We will derive an explicit representation of B as a function of A and B −A , for certain positive integers j, k. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Dynamics in Nature and Society

سال: 2018

ISSN: 1026-0226,1607-887X

DOI: 10.1155/2018/6758302